Near-Optimal Column-Based Matrix Reconstruction

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal column-based low-rank matrix reconstruction

We prove that for any real-valued matrix X ∈ R, and positive integers r > k, there is a subset of r columns of X such that projecting X onto their span gives a

متن کامل

Finding Near-Optimal Rosters Using Column Generation

We consider the following basic rostering problem. The days are divided in three fixed shifts (Early, Late, Night) and for each day (seven days a week) a number of personnel required is given. To man these shifts, a given number of employees are available, who all have their individual preferences. We have to find a year-roster for each person with minimum total cost. This cost consists of two ...

متن کامل

Optimal column density measurements from multiband near-infrared observations

We consider from a general point of view the problem of determining the extinction in dense molecular clouds. We use a rigorous statistical approach to characterize the properties of the most widely used optical and infrared techniques, namely the star count and the color excess methods. We propose a new maximum-likelihood method that takes advantage of both star counts and star colors to provi...

متن کامل

Near-Optimal Algorithms for Online Matrix Prediction

In several online prediction problems of recent interest the comparison class is composed of matrices with bounded entries. For example, in the online max-cut problem, the comparison class is matrices which represent cuts of a given graph and in online gambling the comparison class is matrices which represent permutations over n teams. Another important example is online collaborative filtering...

متن کامل

Near-optimal Binary Compressed Sensing Matrix

Compressed sensing is a promising technique that attempts to faithfully recover sparse signal with as few linear and nonadaptive measurements as possible. Its performance is largely determined by the characteristic of sensing matrix. Recently several zero-one binary sensing matrices have been deterministically constructed for their relative low complexity and competitive performance. Considerin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Computing

سال: 2014

ISSN: 0097-5397,1095-7111

DOI: 10.1137/12086755x